Equational Termination by Semantic Labelling
نویسندگان
چکیده
Semantic labelling is a powerful tool for proving termination of term rewrite systems. The usefulness of the extension to equational term rewriting described in Zantema [24] is however rather limited. In this paper we introduce a stronger version of equational semantical labelling, parameterized by three choices: (1) the order on the underlying algebra (partial order vs. quasi-order), (2) the relation between the algebra and the rewrite system (model vs. quasi-model), and (3) the labelling of the function symbols appearing in the equations (forbidden vs. allowed). We present soundness and completeness results for the various instantiations and analyze the relationships between them. Applications of our equational semantic labelling technique include a short proof of the main result of Ferreira et al. [7]—the correctness of a version of dummy elimination for AC-rewriting which completely removes the AC-axioms— and an extension of Zantema’s distribution elimination technique [23] to the equational setting.
منابع مشابه
Semantic Labelling for Termination of Combinatory Reduction Systems
We give a method of proving termination of Klop’s higher-order rewriting format, combinatory reduction system (CRS). Our method called higher-order semantic labelling is an extension of Zantema’s semantic labelling for first-order term rewriting systems. We systematically define the labelling by using the complete algebraic semantics of CRS.
متن کاملSemantic Labelling for Proving Termination of Combinatory Reduction Systems
We give a novel transformation method for proving termination of higher-order rewrite rules in Klop’s format called Combinatory Reduction System (CRS). The format CRS essentially covers the usual pure higher-order functional programs such as Haskell. Our method called higher-order semantic labelling is an extension of a method known in the theory of term rewriting. This attaches semantics of th...
متن کاملTransforming Termination by Self-Labelling
We introduce a new technique for proving termination of term rewriting systems. The technique, a specialization of Zantema’s semantic labelling technique, is especially useful for establishing the correctness of transformation methods that attempt to prove termination by transforming term rewriting systems into systems whose termination is easier to prove. We apply the technique to modularity, ...
متن کاملAutomation of Recursive Path Ordering for Infinite Labelled Rewrite Systems
Semantic labelling is a transformational technique for proving termination of Term Rewriting Systems (TRSs). Only its variant with finite sets of labels was used so far in tools for automatic termination proving and variants with infinite sets of labels were considered not to be suitable for automation. We show that such automation can be achieved for semantic labelling with natural numbers, in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000